Partitions of digraphs into paths or circuits
نویسندگان
چکیده
From now on we shall omit the word elementary. The problem considered is similar to a problem first considered by Alspach and Pullman in [2], namely, to partition the arcs of a digraph into paths and one of their conjectures (see [2]) has been solved by O'Brien [4], who showed that for IV] = n ~> 4 the arcs of a digraph can be partitioned into [14n2] or fewer paths. Our conjecture is of course closely related to this problem since 3. is clearly bounded above by [~n2J.
منابع مشابه
An Extension of the Greene and Greene-Kleitman Theorems to all Digraphs
Let G be a directed graph, and k a positive integer. We prove that there exists a kcolouring that is orthogonal to every k-optimal partition of V(G) into paths and cycles. This extends the Greene-Kleitman Theorem to all digraphs, and relates to Berge’s conjecture on path partitions and k-colourings. We also show that there exists a colouring that is orthogonal to every optimal collection of k d...
متن کاملOn enumerating chordless circuits in directed graphs
We introduce and discuss an algorithm using O(p) time and O(n(n + m)) space for enumerating the m > 0 chordless circuits in a digraph of order n and containing p chordless paths. Running it on random digraphs yields some statistical insight into its practical performance.
متن کاملDeterminants , Paths , and Plane Partitions ( 1989 preprint )
In studying representability of matroids, Lindström [42] gave a combinatorial interpretation to certain determinants in terms of disjoint paths in digraphs. In a previous paper [25], the authors applied this theorem to determinants of binomial coefficients. Here we develop further applications. As in [25], the paths under consideration are lattice paths in the plane. Our applications may be div...
متن کاملOn Greene-Kleitman's theorem for general digraphs
Aharoni, R. and I. Ben-Arroyo Hartman, On Greene-Kleitman’s theorem for general digraphs, Discrete Mathematics 120 (1993) 13-24. Linial conjectured that Greene-Kleitman’s theorem can be extended to general digraphs. We prove a stronger conjecture of Berge for digraphs having k-optimal path partitions consisting of ‘long’ paths. The same method yields known results for acyclic digraphs, and exte...
متن کاملComplexity of Paths, Trails and Circuits in Arc-Colored Digraphs
We deal with different algorithmic questions regarding properly arc-colored s-t paths, trails and circuits in arc-colored digraphs. Given an arc-colored digraph D with c ≥ 2 colors, we show that the problem of maximizing the number of arc disjoint properly arc-colored s-t trails can be solved in polynomial time. Surprisingly, we prove that the determination of one properly arc-colored s-t path ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 61 شماره
صفحات -
تاریخ انتشار 1986